0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.12	% Command    : run_E %s %d THM
0.13/0.34	% Computer : n023.cluster.edu
0.13/0.34	% Model    : x86_64 x86_64
0.13/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory   : 8042.1875MB
0.13/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 1440
0.13/0.34	% WCLimit    : 180
0.13/0.34	% DateTime   : Thu Jul  4 07:14:24 EDT 2024
0.13/0.34	% CPUTime    : 
0.20/0.48	Running higher-order theorem proving
0.20/0.49	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.beTMEMZCWU/E---3.1_18870.p
25.92/3.77	# Version: 3.2.0-ho
25.92/3.77	# Preprocessing class: HSSSSMSSSSSNHHA.
25.92/3.77	# Scheduled 5 strats onto 8 cores with 180 seconds (1440 total)
25.92/3.77	# Starting sh2lt with 720s (4) cores
25.92/3.77	# Starting new_ho_10_unif with 180s (1) cores
25.92/3.77	# Starting full_lambda_6 with 180s (1) cores
25.92/3.77	# Starting post_as_ho1 with 180s (1) cores
25.92/3.77	# Starting ehoh_best3_rw with 180s (1) cores
25.92/3.77	# new_ho_10_unif with pid 18949 completed with status 0
25.92/3.77	# Result found by new_ho_10_unif
25.92/3.77	# Preprocessing class: HSSSSMSSSSSNHHA.
25.92/3.77	# Scheduled 5 strats onto 8 cores with 180 seconds (1440 total)
25.92/3.77	# Starting sh2lt with 720s (4) cores
25.92/3.77	# Starting new_ho_10_unif with 180s (1) cores
25.92/3.77	# No SInE strategy applied
25.92/3.77	# Search class: HGHNF-FFSF22-SHHFFSBN
25.92/3.77	# Scheduled 5 strats onto 1 cores with 180 seconds (180 total)
25.92/3.77	# Starting new_ho_10_unif with 60s (1) cores
25.92/3.77	# new_ho_10_unif with pid 18958 completed with status 0
25.92/3.77	# Result found by new_ho_10_unif
25.92/3.77	# Preprocessing class: HSSSSMSSSSSNHHA.
25.92/3.77	# Scheduled 5 strats onto 8 cores with 180 seconds (1440 total)
25.92/3.77	# Starting sh2lt with 720s (4) cores
25.92/3.77	# Starting new_ho_10_unif with 180s (1) cores
25.92/3.77	# No SInE strategy applied
25.92/3.77	# Search class: HGHNF-FFSF22-SHHFFSBN
25.92/3.77	# Scheduled 5 strats onto 1 cores with 180 seconds (180 total)
25.92/3.77	# Starting new_ho_10_unif with 60s (1) cores
25.92/3.77	# Preprocessing time       : 0.001 s
25.92/3.77	# Presaturation interreduction done
25.92/3.77	
25.92/3.77	# Proof found!
25.92/3.77	# SZS status Theorem
25.92/3.77	# SZS output start CNFRefutation
25.92/3.77	thf(decl_sort1, type, a: $tType).
25.92/3.77	thf(decl_22, type, epred1_0: a > a > $o).
25.92/3.77	thf(decl_23, type, esk1_0: (a > $o) > a).
25.92/3.77	thf(decl_24, type, esk2_2: (a > $o) > a > a).
25.92/3.77	thf(decl_25, type, esk3_0: a > a).
25.92/3.77	thf(cTHM145L_pme, conjecture, ![X1:a > a > $o, X2:(a > $o) > a]:(((![X3:a, X4:a, X5:a]:(((X1 @ X3 @ X5)<=((X1 @ X3 @ X4)&(X1 @ X4 @ X5))))&![X6:a > $o]:((![X7:a]:(((X1 @ (X2 @ X6) @ X7)<=![X8:a]:(((X1 @ X8 @ X7)<=(X6 @ X8)))))&![X5:a]:(((X1 @ X5 @ (X2 @ X6))<=(X6 @ X5))))))=>![X9:a > a]:((?[X10:a]:(((X1 @ (X9 @ X10) @ X10)&(X1 @ X10 @ (X9 @ X10))))<=![X3:a, X4:a]:(((X1 @ X3 @ X4)=>(X1 @ (X9 @ X3) @ (X9 @ X4)))))))), file('/export/starexec/sandbox2/tmp/tmp.beTMEMZCWU/E---3.1_18870.p', cTHM145L_pme)).
25.92/3.77	thf(c_0_1, negated_conjecture, ~(![X1:a > a > $o, X2:(a > $o) > a]:(((![X3:a, X4:a, X5:a]:((((X1 @ X3 @ X4)&(X1 @ X4 @ X5))=>(X1 @ X3 @ X5)))&![X6:a > $o]:((![X7:a]:((![X8:a]:(((X6 @ X8)=>(X1 @ X8 @ X7)))=>(X1 @ (X2 @ X6) @ X7)))&![X5:a]:(((X6 @ X5)=>(X1 @ X5 @ (X2 @ X6)))))))=>![X9:a > a]:((![X3:a, X4:a]:(((X1 @ X3 @ X4)=>(X1 @ (X9 @ X3) @ (X9 @ X4))))=>?[X10:a]:(((X1 @ (X9 @ X10) @ X10)&(X1 @ X10 @ (X9 @ X10))))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM145L_pme])])).
25.92/3.77	thf(c_0_2, negated_conjecture, ![X26:a, X27:a, X28:a, X29:a > $o, X30:a, X32:a, X34:a, X35:a, X36:a]:((((~(epred1_0 @ X26 @ X27)|~(epred1_0 @ X27 @ X28)|(epred1_0 @ X26 @ X28))&((((X29 @ (esk2_2 @ X29 @ X30))|(epred1_0 @ (esk1_0 @ X29) @ X30))&(~(epred1_0 @ (esk2_2 @ X29 @ X30) @ X30)|(epred1_0 @ (esk1_0 @ X29) @ X30)))&(~(X29 @ X32)|(epred1_0 @ X32 @ (esk1_0 @ X29)))))&((~(epred1_0 @ X34 @ X35)|(epred1_0 @ (esk3_0 @ X34) @ (esk3_0 @ X35)))&(~(epred1_0 @ (esk3_0 @ X36) @ X36)|~(epred1_0 @ X36 @ (esk3_0 @ X36)))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])).
25.92/3.77	thf(c_0_3, negated_conjecture, ![X3:a, X4:a, X5:a]:(((epred1_0 @ X3 @ X5)|~((epred1_0 @ X3 @ X4))|~((epred1_0 @ X4 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_2])).
25.92/3.77	thf(c_0_4, negated_conjecture, ![X3:a, X4:a]:(((epred1_0 @ (esk3_0 @ X3) @ (esk3_0 @ X4))|~((epred1_0 @ X3 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])).
25.92/3.77	thf(c_0_5, negated_conjecture, ![X3:a, X5:a, X4:a]:(((epred1_0 @ X3 @ (esk3_0 @ X4))|~((epred1_0 @ X3 @ (esk3_0 @ X5)))|~((epred1_0 @ X5 @ X4)))), inference(spm,[status(thm)],[c_0_3, c_0_4])).
25.92/3.77	thf(c_0_6, negated_conjecture, ![X6:a > $o, X3:a]:(((X6 @ (esk2_2 @ X6 @ X3))|(epred1_0 @ (esk1_0 @ X6) @ X3))), inference(split_conjunct,[status(thm)],[c_0_2])).
25.92/3.77	thf(c_0_7, negated_conjecture, ![X6:a > $o, X3:a]:(((epred1_0 @ X3 @ (esk1_0 @ X6))|~((X6 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_2])).
25.92/3.77	thf(c_0_8, negated_conjecture, ![X3:a, X20:a > a, X9:a > a, X4:a]:(((epred1_0 @ (X9 @ (esk2_2 @ (^[Z0/* 3 */:a]:((epred1_0 @ (X9 @ Z0) @ (esk3_0 @ (X20 @ Z0))))) @ X3)) @ (esk3_0 @ X4))|(epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ (X9 @ Z0) @ (esk3_0 @ (X20 @ Z0)))))) @ X3)|~((epred1_0 @ (X20 @ (esk2_2 @ (^[Z0/* 3 */:a]:((epred1_0 @ (X9 @ Z0) @ (esk3_0 @ (X20 @ Z0))))) @ X3)) @ X4)))), inference(spm,[status(thm)],[c_0_5, c_0_6])).
25.92/3.77	thf(c_0_9, negated_conjecture, ![X1:a > a > $o, X3:a]:(((epred1_0 @ (esk2_2 @ (^[Z0/* 3 */:a]:((X1 @ Z0 @ Z0))) @ X3) @ (esk1_0 @ (^[Z0/* 3 */:a]:((X1 @ Z0 @ Z0)))))|(epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((X1 @ Z0 @ Z0)))) @ X3))), inference(spm,[status(thm)],[c_0_7, c_0_6])).
25.92/3.77	thf(c_0_10, negated_conjecture, ![X6:a > $o, X3:a]:(((epred1_0 @ (esk1_0 @ X6) @ X3)|~((epred1_0 @ (esk2_2 @ X6 @ X3) @ X3)))), inference(split_conjunct,[status(thm)],[c_0_2])).
25.92/3.77	thf(c_0_11, negated_conjecture, ![X3:a]:(((epred1_0 @ (esk2_2 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))) @ X3) @ (esk3_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))))))|(epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0))))) @ X3))), inference(spm,[status(thm)],[c_0_8, c_0_9])).
25.92/3.77	thf(c_0_12, negated_conjecture, ![X9:a > a, X3:a]:(((epred1_0 @ (esk3_0 @ X3) @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ (X9 @ Z0)))))))|~((epred1_0 @ X3 @ (X9 @ (esk3_0 @ X3)))))), inference(spm,[status(thm)],[c_0_7, c_0_4])).
25.92/3.77	thf(c_0_13, negated_conjecture, (epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0))))) @ (esk3_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0))))))), inference(spm,[status(thm)],[c_0_10, c_0_11])).
25.92/3.77	thf(c_0_14, negated_conjecture, ![X3:a]:((~((epred1_0 @ (esk3_0 @ X3) @ X3))|~((epred1_0 @ X3 @ (esk3_0 @ X3))))), inference(split_conjunct,[status(thm)],[c_0_2])).
25.92/3.77	thf(c_0_15, negated_conjecture, (epred1_0 @ (esk3_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))))) @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))))), inference(spm,[status(thm)],[c_0_12, c_0_13])).
25.92/3.77	thf(c_0_16, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_13])]), ['proof']).
25.92/3.77	# SZS output end CNFRefutation
25.92/3.77	# Parsed axioms                        : 2
25.92/3.77	# Removed by relevancy pruning/SinE    : 0
25.92/3.77	# Initial clauses                      : 7
25.92/3.77	# Removed in clause preprocessing      : 1
25.92/3.77	# Initial clauses in saturation        : 6
25.92/3.77	# Processed clauses                    : 865
25.92/3.77	# ...of these trivial                  : 128
25.92/3.77	# ...subsumed                          : 272
25.92/3.77	# ...remaining for further processing  : 465
25.92/3.77	# Other redundant clauses eliminated   : 0
25.92/3.77	# Clauses deleted for lack of memory   : 0
25.92/3.77	# Backward-subsumed                    : 29
25.92/3.77	# Backward-rewritten                   : 47
25.92/3.77	# Generated clauses                    : 48582
25.92/3.77	# ...of the previous two non-redundant : 41702
25.92/3.77	# ...aggressively subsumed             : 0
25.92/3.77	# Contextual simplify-reflections      : 0
25.92/3.77	# Paramodulations                      : 48398
25.92/3.77	# Factorizations                       : 183
25.92/3.77	# NegExts                              : 0
25.92/3.77	# Equation resolutions                 : 1
25.92/3.77	# Disequality decompositions           : 0
25.92/3.77	# Total rewrite steps                  : 7285
25.92/3.77	# ...of those cached                   : 6320
25.92/3.77	# Propositional unsat checks           : 0
25.92/3.77	#    Propositional check models        : 0
25.92/3.77	#    Propositional check unsatisfiable : 0
25.92/3.77	#    Propositional clauses             : 0
25.92/3.77	#    Propositional clauses after purity: 0
25.92/3.77	#    Propositional unsat core size     : 0
25.92/3.77	#    Propositional preprocessing time  : 0.000
25.92/3.77	#    Propositional encoding time       : 0.000
25.92/3.77	#    Propositional solver time         : 0.000
25.92/3.77	#    Success case prop preproc time    : 0.000
25.92/3.77	#    Success case prop encoding time   : 0.000
25.92/3.77	#    Success case prop solver time     : 0.000
25.92/3.77	# Current number of processed clauses  : 383
25.92/3.77	#    Positive orientable unit clauses  : 92
25.92/3.77	#    Positive unorientable unit clauses: 0
25.92/3.77	#    Negative unit clauses             : 15
25.92/3.77	#    Non-unit-clauses                  : 276
25.92/3.77	# Current number of unprocessed clauses: 40344
25.92/3.77	# ...number of literals in the above   : 125906
25.92/3.77	# Current number of archived formulas  : 0
25.92/3.77	# Current number of archived clauses   : 82
25.92/3.77	# Clause-clause subsumption calls (NU) : 11964
25.92/3.77	# Rec. Clause-clause subsumption calls : 10030
25.92/3.77	# Non-unit clause-clause subsumptions  : 293
25.92/3.77	# Unit Clause-clause subsumption calls : 2672
25.92/3.77	# Rewrite failures with RHS unbound    : 0
25.92/3.77	# BW rewrite match attempts            : 2202
25.92/3.77	# BW rewrite match successes           : 57
25.92/3.77	# Condensation attempts                : 865
25.92/3.77	# Condensation successes               : 9
25.92/3.77	# Termbank termtop insertions          : 12462542
25.92/3.77	# Search garbage collected termcells   : 389
25.92/3.77	
25.92/3.77	# -------------------------------------------------
25.92/3.77	# User time                : 3.056 s
25.92/3.77	# System time              : 0.142 s
25.92/3.77	# Total time               : 3.198 s
25.92/3.77	# Maximum resident set size: 1712 pages
25.92/3.77	
25.92/3.77	# -------------------------------------------------
25.92/3.77	# User time                : 3.056 s
25.92/3.77	# System time              : 0.145 s
25.92/3.77	# Total time               : 3.201 s
25.92/3.77	# Maximum resident set size: 1728 pages
25.92/3.77	% E---3.1 exiting
25.92/3.77	% E exiting
25.92/3.77	EOF
